Automorphisms of Constant Weight Codes and of Divisible Designs
نویسندگان
چکیده
We show that the automorphism group of a divisible design D is isomorhic to a subgroup H of index 1 or 2 in the automorphism group Aut C(D) of the associated constant weight code. Only in very special cases, H is not the full automorphism group.
منابع مشابه
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
Let Kq(n, w, t, d) be the minimum size of a code over Zq of length n, constant weight w, such that every word with weight t is within Hamming distance d of at least one codeword. In this article, we determine Kq(n, 4, 3, 1) for all n ≥ 4, q = 3, 4 or q = 2m + 1 with m ≥ 2, leaving the only case (q, n) = (3, 5) in doubt. Our construction method is mainly based on the auxiliary designs, H-frames,...
متن کاملQuaternary Constant-Composition Codes with Weight Four and Distances Five or Six
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Roo...
متن کاملCodes with a Certain Weight-preserving Transitive Group of Automorphisms
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C.
متن کاملJacobi Polynomials, Type II Codes, and Designs
Jacobi polynomials were introduced by Ozeki in analogy with Jacobi forms of lattices They are useful for coset weight enumeration and weight enumeration of children We determine them in most interesting cases in length at most and in some cases in length We use them to construct group divisible designs packing designs covering designs and t r designs in the sense of Calderbank Delsarte A major ...
متن کاملConstructions of optimal quaternary constant weight codes via group divisible designs
Generalized Steiner systems GS(2, k, v, g) were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 2k − 3, in which each codeword has length v and weight k. As to the existence of a GS(2, k, v, g), a lot of work has been done for k = 3, while not so much is known for k = 4. The notion k-GDD was first introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 20 شماره
صفحات -
تاریخ انتشار 2000